Optimizing the Region Algebra is PSPACE-complete
نویسندگان
چکیده
The Region Algebra is a set-at-a-time algebra for querying text regions. We show that satisfiability, inclusion, and equivalence testing of region algebra expressions are PSPACE-complete. This improves upon the previously known NP lower bounds and EXPTIME upper bounds.
منابع مشابه
Hypothesis Elimination in Kleene Semirings
—A Kleene Semiring (KS) is an algebraic structure satisfying the axioms of Kleene algebra, minus the annihilation axioms x.0 = 0 = 0.x. We show that, like Kleene algebra (KA), KS admits efficient elimination of various kinds of equational hypotheses, in particular Hoare formulas (x = 0). Our method is purely proof-theoretic, and can be used to eliminate Horn hypotheses in any suitable Horn-equa...
متن کاملOn the Translation of Qualitative Spatial Reasoning Problems into Modal Logics
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A translation of RCC8 constraints into a multimodal logic has been proposed by Bennett, but in his work a thorough semantical foundation of RCC8 and of the translation into modal logic is missing. In the present paper, ...
متن کاملAutomatic Proof Generation in Kleene Algebra
In this paper, we develop the basic theory of disimulations, a type of relation between two automata which witnesses equivalence. We show that many standard constructions in the theory of automata such as determinization, minimization, inaccessible state removal, et al., are instances of disimilar automata. Then, using disimulations, we define an “algebraic” proof system for the equational theo...
متن کاملComplexity of Checking Bisimilarity between Sequential and Parallel Processes
Decidability of bisimilarity for Process Algebra (PA) processes, arising by mixing sequential and parallel composition, is a longstanding open problem. The known results for subclasses contain the decidability of bisimilarity between basic sequential (i.e. BPA) processes and basic parallel processes (BPP). Here we revisit this subcase and derive an exponential-time upper bound. Moreover, we sho...
متن کاملThe Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(B). Extending the algebraic methods of a previous paper, we derive a complete complexity classification for these problems as B ranges over structures of d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010